Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs
نویسندگان
چکیده
Hoffmann–Ostenhof’s conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, matching and 2-regular subgraph. In this paper, we show holds for claw-free subcubic graphs 4-chordal graphs.
منابع مشابه
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
We study methods of planarizing and acyclically coloring claw-free subcubic graphs. We give a polynomial-time algorithm that, given such a graph G, produces an independent set Q of at most n/6 vertices whose removal from G leaves an induced planar subgraph P (in fact, P has treewidth at most four). We further show the stronger result that in polynomial-time a set of at most n/6 edges can be ide...
متن کاملBipartite density of triangle-free subcubic graphs
A graph is subcubic if its maximum degree is at most 3. The bipartite density of a graph G is defined as b(G) = max{|E(B)|/|E(G)| : B is a bipartite subgraph of G}. It was conjectured by Bondy and Locke that if G is a triangle-free subcubic graph, then b(G) ≥ 45 and equality holds only if G is in a list of seven small graphs. The conjecture has been confirmed recently by Xu and Yu. This note gi...
متن کاملBipartite subgraphs of triangle-free subcubic graphs
Suppose G is a graph with n vertices and m edges. Let n′ be the maximum number of vertices in an induced bipartite subgraph of G and let m′ be the maximum number of edges in a spanning bipartite subgraph of G. Then b(G) = m′/m is called the bipartite density of G, and b∗(G) = n′/n is called the bipartite ratio of G. This paper proves that every 2connected triangle-free subcubic graph, apart fro...
متن کاملExponential Domination in Subcubic Graphs
As a natural variant of domination in graphs, Dankelmann et al. [Domination with exponential decay, Discrete Math. 309 (2009) 5877-5883] introduced exponential domination, where vertices are considered to have some dominating power that decreases exponentially with the distance, and the dominated vertices have to accumulate a sufficient amount of this power emanating from the dominating vertice...
متن کاملColoring Algorithms on Subcubic Graphs
We present efficient algorithms for three coloring problems on subcubic graphs. (A subcubic graph has maximum degree at most three.) The first algorithm is for 4-edge coloring, or more generally, 4-list-edge coloring. Our algorithm runs in linear time, and appears to be simpler than previous ones. The second algorithm is the first randomized EREW PRAM algorithm for the same problem. It uses O(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2021
ISSN: ['1872-6771', '0166-218X']
DOI: https://doi.org/10.1016/j.dam.2020.01.016